Parallel distance transforms on a linear array architecture
نویسندگان
چکیده
منابع مشابه
Parallel distance transforms on a linear array architecture
Distance transformation (DT) has been widely used for image matching and shape analysis. In this paper, a parallel algorithm for computing distance transformation is presented. First, it is shown that the algorithm has an execution time of 6N − 4 cycles, for an N ×N image using a parallel architecture that requires N/2 parallel processors. By doing so, the real time requirement is fulfilled and...
متن کاملA Parallel Algorithm for Weighted Distance Transforms
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n n binary image. We show that the algorithm runs in O(log n) time using n2= logn processors on the EREW PRAM and in O(log log n) time using n2= log log n processors on the common CRCW PRAM. We also show that the algorithm runs in O(n2=p2 + n) time on a p p mesh and in O(n2=p2 +(...
متن کاملParallel Execution of a Connected Component Labeling Operation on a Linear Array Architecture
This work presents a novel parallel algorithm and architecture for finding connected components in an image. Simulation results indicate that the proposed algorithm has an execution time of N+6N-4 cycles for an N×N image using an architecture containing 4 parallel processors. The proposed hardware can process a 128 × 128 image in 0.8574 ms and uses only 4 processors, compared to 0.85 ms and 128...
متن کاملLinear time distance transforms for quadtrees
The (region) quadtree, shown in Fig. 1, is a widely studied data structure for representing digitized images. An extensive survey of quadtrees and their use in image processing and graphics appears in Samet [ 1,2]. Unfortunately, the two-dimensional nature of the information they store makes quadtree usage more subtle than, say, binary search tree usage, and efficient algorithms often demand sp...
متن کاملDistributed Memory Parallel Architecture Based on Modular Linear Arrays for 2-D Separable Transforms Computation
A framework for mapping systematically 2-dimensional (2-D) separable transforms into a parallel architecture consisting of fully pipelined linear array stages is presented. The resulting model architecture is characterized by its generality, high degree of modularity, high throughput, and the exclusive use of distributed memory and control. There is no central shared memory block to facilitate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2002
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00250-2